On k-ary n-cubes: Theory and Applications
نویسندگان
چکیده
7 Many parallel processing applications have communication patterns that can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and tori. In this paper, 9 combinatorial properties of k-ary n-cubes are examined. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These 11 theoretical results are then applied to compute a lower bounding function in branch-and-bound partitioning algorithms and to establish the optimality of some irregular partitions. ? 2002 Pub13 lished by Elsevier Science B.V.
منابع مشابه
On k - ary n - cubes : Theory and Applications 1
Many parallel processing networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and toruses. In this paper, combinatorial properties of k-ary n-cubes are explored. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These theoretical results are then used to compute a lower bou...
متن کاملCombinatorics of k-ary n-cubes with Applications to Partitioning
Many communication networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes, and toruses. This paper explores combinatorial properties of such graphs—in particular, the characterization of the subgraph of a given number of nodes with maximum edge count. Applications of these properties to partitioning parallel computations will also be discussed.
متن کاملAugmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...
متن کاملExtra connectivity measures of 3-ary n-cubes
The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...
متن کاملOn the Performance Merits of Bypass Channels in Hypermeshes and k-Ary n-Cubes
Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topolo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 129 شماره
صفحات -
تاریخ انتشار 2003